Initial Semantics for Strengthened Signatures
نویسندگان
چکیده
منابع مشابه
Initial Semantics for Strengthened Signatures
We give a new general definition of arity, yielding the companion notions of signature and associated syntax. This setting is modular in the sense requested by [12]: merging two extensions of syntax corresponds to building an amalgamated sum. These signatures are too general in the sense that we are not able to prove the existence of an associated syntax in this general context. So we have to s...
متن کاملStrengthened Security for Blind Signatures
Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. More recently, a new approach to achieve some kind of provable security was explored using the so-called “random oracle model”. Last year, Stern and the author studied the security of blind signatures in this model. We first defi...
متن کاملAn Architecture for Generating Semantics-Aware Signatures
Identifying new intrusions and developing effective signatures that detect them is essential for protecting computer networks. We present Nemean, a system for automatic generation of intrusion signatures from honeynet packet traces. Our architecture is distinguished by its emphasis on a modular design framework that encourages independent development and modification of system components and pr...
متن کاملBenedikt Ahrens: Initial Semantics for Reduction Rules
We give an algebraic characterization of the syntax and operational semantics of a class of simply–typed languages, such as the language PCF: we characterize simply–typed syntax with variable binding and equipped with reduction rules via a universal property, namely as the initial object of some category of models. For this purpose, we employ techniques developed in two previous works: Ahrens (...
متن کاملInitial Algebra Semantics for Cyclic Sharing Structures
syntax Set ADJ 1975 S-sorted abstract syntax Set Robinson 1994 Abstract syntax with binding SetF Fiore,Plotkin,Turi 1999 Recursive path ordring LO R. Hasegawa 2002 S-sorted 2nd-order abs. syn. (SetF↓S)S Fiore 2003 2nd-order rewriting systems PreF Hamana 2005 Explicit substitutions [Set,Set]f Ghani,Uustalu,Hamana 2006 Cyclic sharing structures (SetT ∗ )T Hamana 2009
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.77.5